Optimized deployment of parts in a distribution network

ABSTRACT

A method for deploying parts is disclosed. Locations that include supply locations and demand locations are defined. A supply location supplies parts to a demand location. A demand is computed for each part at each location. An availability lead-time is estimated for each part at each location. A lead-time demand is computed for each part at each location using the availability lead-times for the part. A stock level is computed for each part at each location. A completely filled demand is determined from the lead-time demands and the stock levels, and a partially filled demand is determined from the lead-time demands and the stock levels. A coverage function for the parts at the locations is generated from the completely filled demand and the partially filled demand.

CLAIM OF PRIORITY

This is a divisional application of U.S. patent application Ser. No. 10/032,971, filed on 25 Oct. 2001 and entitled “OPTIMIZED DEPLOYMENT OF PARTS IN A DISTRIBUTION NETWORK”, which claims the benefit under 35 U.S.C. § 119(e) of U.S. Provisional Application Ser. No. 60/243,659, filed Oct. 26, 2000, entitled “SYSTEM AND METHOD FOR OPTIMIZED DEPLOYMENT OF INVENTORY, OR REDISTRIBUTION OF EXISTING INVENTORY, ACROSS A MULTI-ECHELON DISTRIBUTION NETWORK” and which is related to U.S. patent application Ser. No. 10/033,103, entitled “REDISTRIBUTION OF PARTS IN A DISTRIBUTION NETWORK,” by Rosa H. Birjandi, et al., filed Oct. 25, 2001.

BACKGROUND

U.S. patent application Ser. No. 10/033,103, U.S. patent application Ser. No. 10/032,971, U.S. Provisional Application Ser. No. 60/243,659 are commonly assigned to the assignee of the present application. The disclosure of related U.S. patent application Ser. No. 10/033,103, U.S. patent application Ser. No. 10/032,971, U.S. Provisional Application Ser. No. 60/243,659 are hereby incorporated by reference into the present disclosure as if fully set forth herein.

1. Technical Field of the Invention

This invention relates generally to the field of inventory distribution networks and more specifically to optimized deployment of parts in a distribution network.

2. Background of the Invention

Distribution networks may include one or more locations that receive parts from a vendor and distribute the parts within the distribution network in order to provide a customer with a product. The parts may be, for example, manufactured into a product within the distribution network. Distribution networks may include locations that both supply parts to and receive parts from other locations. Performance at each location is thus affected by the performance at its suppliers. As a result, maintaining an optimal inventory of parts at each location that best serves the customer while minimizing inventory costs poses a challenge for inventory managers.

SUMMARY OF THE INVENTION

In accordance with the present invention, disadvantages and problems associated with inventory deployment and redistribution techniques are reduced or eliminated.

According to one example of the present invention, a method for deploying parts is disclosed. Locations that include supply locations and demand locations are defined. A supply location supplies parts to a demand location. A demand is computed for each part at each location. An availability lead-time is estimated for each part at each location. A lead-time demand is computed for each part at each location using the availability lead-times for the part. A stock level is computed for each part at each location. A completely filled demand is determined from the lead-time demands and the stock levels, and a partially filled demand is determined from the lead-time demands and the stock levels. A coverage function for the parts at the locations is generated from the completely filled demand and the partially filled demand.

Certain examples of the invention may provide one or more technical advantages. The present invention may be used to determine an optimized inventory deployment plan that describes the inventory at each location of a distribution network. The inventory deployment plan may optimize the ability of the distribution network to satisfy customer demand while conforming to business constraints. The inventory deployment plan may maximize the ability of the distribution network to fill orders, which may be calculated by minimizing the expected backorder of the distribution network. The present invention may be used to formulate a coverage function that is optimized to determine an optimized inventory deployment plan. Coverage may be used as a measure of customer service that describes the expected ability of each location to completely or partially fill a demand for a part. The present invention may be used to compute the expected number of partially and completely backordered demand for a part.

The present invention may be used to calculate a net demand for a part at a location that accounts for dependent demands and independent demands. A dependent demand at a location describes the parts that the location supplies to other locations in the distribution network, and an independent demand at a location describes the parts used at the location. Incorporating the independent and dependent demand into the demand may provide for a more accurate calculation of the demand. The present invention may be used to calculate a demand for a part at a location that takes into account the probability that the part is repaired and placed back into the inventory at the location. By taking into account the repaired parts, the calculation of the demand may be more accurate.

The present invention may be used to calculate the availability lead-time for a part at any number of supply locations. The demand location may order a certain proportion of parts from the supply locations in a particular order. The computation of the availability lead-time takes into account the probability that a supply location supplies the part, given that no other supply location has supplied the part, which may provide a more realistic calculation of availability lead-time. The replenishment lead-time at a demand end point may be computed as the availability lead-time at its supplier plus the transfer lead-time from the supplier to the demand end point.

The present invention may be used to calculate the expected number of backordered demand for a part at a location from the partially backordered and completely backordered demand. An equivalence relation between maximizing the coverage function and minimizing the sum of backorders may be determined.

Other technical advantages may be readily apparent to one skilled in the art from the figures, descriptions and claims included herein.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention and its features and advantages, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:

FIG. 1 illustrates an example distribution network for deploying and redistributing inventory of one or more parts among one or more locations;

FIG. 2 illustrates an example system that generates optimized inventory deployment and redistribution plans;

FIG. 3 illustrates an example method for deploying and redistributing inventory of one or more parts among one or more locations;

FIG. 4 illustrates an example method for calculating a demand for one or more parts at one or more locations;

FIG. 5 illustrates an example method for estimating the availability of one or more parts at one or more locations; and

FIG. 6 illustrates an example method for generating a coverage function for one or more parts at one or more locations.

DETAILED DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example distribution network 20 for deploying and redistributing inventory of one or more parts among one or more locations 22. Distribution network 20 includes locations 22 that distribute parts throughout distribution network 20. A part may comprise, for example, a product, a portion of a product, a device used to manufacture a product, or any other suitable item that may be distributed from one location 22 to another location 22 in distribution network 20.

In one embodiment, locations 22 include a central location 22 a and one or more warehouse locations 22 b-d. Although central location 22 a and warehouse locations 22 b-d are illustrated, distribution network 20 may include any suitable number of central locations 22 and warehouse locations 22. Each location 22 may comprise a supply location and/or a demand location. A supply location supplies a part to a demand location, and may supply the part in response to an order for the part sent from the demand location. For example, warehouse location 22 b supplies parts to warehouse location 22d, and warehouse locations 22 b-c supply parts to location 22 d. A location 22 may comprise both a demand location and a supply location. For example, warehouse location 22 b receives parts from central location 22 a and supplies parts to warehouse location 22 d. A supply endpoint such as central location 22 a receives parts from one or more external supplies 24, for example, a vendor, and distributes the parts to warehouse locations 22 b-d. A demand endpoint such as warehouse location 22 d provides parts to one or more external demands 32, for example, a customer.

Warehouse locations 22 b-d may include supply operations 26 b-d and/or repair operations 28 b-d. A supply operation 26 sends an order for a part to a supply location, which in response sends the part to supply operation 26. A repair operation 28 may receive a broken part from supply operation 26 and send the broken part to a repair center 30. Repair center 30 repairs the part and sends the repaired part to, for example, central location 22 a or back to supply operation 26 b. Alternatively, repair operation 28 d may receive a broken part from supply operation 26 d, repair the part, and send the repaired part back to supply operation 26 d.

The inventory for each part at each location 22 is monitored, continuously or periodically. In response to the inventory falling below a predetermined level, an order is placed to bring the inventory position back up to a target level such as an optimized inventory level. A method for deploying and redistributing inventory of one or more parts among one or more locations to achieve optimized inventory levels is described in more detail with reference to FIG. 2.

FIG. 2 illustrates an example system 34 that generates optimized inventory deployment and redistribution plans. An inventory deployment plan describes a distribution of parts among locations 22 of distribution network 20, and an inventory redistribution plan describes a manner of redistributing parts to satisfy an inventory deployment plan. Deployment may occur independently of redistribution. That is, inventory may be deployed, without ever being redistributed. Additionally, redistribution may redistribute parts according to any suitable inventory plan.

System 34 may include a computer system 35, a server 36, and a database 37, which may share data storage, communications, or other resources according to particular needs. Computer system 35 may include appropriate input devices, output devices, mass storage media, processors, memory, or other components for receiving, processing, storing, and communicating information according to the operation of system 34. As used in this document, the term “computer” is intended to encompass a personal computer, workstation, network computer, wireless data port, wireless telephone, personal digital assistant, one or more microprocessors within these or other devices, or any other suitable processing device.

Server 36 manages applications that generate optimized inventory deployment and redistribution plans. Server 36 includes one or more software components such as a pre-processing module 38 and a solver 39. Pre-processing module 38 manages input and output operations, and computes a net demand and a replenishment lead-time for each part at each location 22. Pre-processing module 38 computes a demand over lead-time, or lead-time demand, related to a number of parts in a pipeline. Preprocessing module 38 also generates mathematical formulations, which are transmitted to solver 39 for solving.

Pre-processing module 38 may include a deployment module 40 and a redistribution module. Deployment module 40 may be used to generate a coverage function that describes the distribution of parts among locations 22. Solver 39 optimizes the coverage function to determine an optimized distribution of parts. Solver 39 may comprise any suitable mathematical programming solver such as CPLEX by ILOG, INC. Redistribution module may be used to generate a transfer function that describes the cost of transferring parts among locations 22. Solver 39 optimizes the transfer function to determine an optimized manner of redistributing parts. As noted above, deployment may occur independently of redistribution. That is, inventory may be deployed, without ever being redistributed. Additionally, redistribution may redistribute parts according to an inventory plan generated by deployment module 40 or according to any suitable inventory plan.

Database 40 stores data that may be used by server 36. Data may include, for example, the history of the demand for each part at each location 22, the lead-time required to transport a part from one location 22 to another location 22, and the maximum space capacity at location 22. Computing system 35 and database 40 may be coupled to server 36 using one or more local area networks (LANs), metropolitan area networks (MANS), wide area networks (WANs), a global computer network such as the Internet, or any other appropriate wired, optical, wireless, or other links.

FIG. 3 illustrates an example method for deploying and redistributing inventory of one or more parts among one or more locations 22. Deployment may occur independently of redistribution. That is, inventory may be deployed, without ever being redistributed. Additionally, redistribution may redistribute parts according to the inventory deployment plan described in connection with FIG. 3, or according to any suitable inventory plan.

Processing module 38 initiates the method at step 46 by defining a number 1, 2, . . . , i, . . . , I of parts and a number 1, 2, . . . , j, . . . , J of locations 22. For example, j=1, 2, 3 and 4 and refer to warehouse locations 22 a-d, respectively. At step 48, data is accessed from database 37. Data may include, for example, a demand history of each part at each location 22. The demand history may describe the parts that each location 22 requires. Data may include repair history that may describe the capability of each location 22 to repair a part. Data may include the paths that may be used to transfer parts between locations 22, along with the costs associated with transporting parts along the paths. Data may include the cost of purchasing a part, the cost of storing a part in the location as a percentage of the purchase cost for the part, and a cost associated with ordering a part.

At step 50, a demand for each part at each location 22 is calculated. The demand may include a dependent demand and an independent demand. A dependent demand at location 22 describes the parts that location 22 supplies to other locations 22. An independent demand at location 22 describes parts used at location 22. The demand at location 22 may account for the probability that a part is repaired and placed back into the inventory at location 22. Demand may be calculated by starting at a demand endpoint and ending at a supply endpoint of distribution network 20. A method for calculating a demand for a part at each location 22 is described in more detail with reference to FIG. 4.

A replenishment lead-time for each part at each location 22 is calculated at step 52. The replenishment lead-time for a part at location 22 describes the time required for location 22 to receive the part from another location 22. The replenishment lead-time may be computed by starting at a supply endpoint and ending at a demand endpoint. An availability lead-time for each part at each location 22 is estimated at step 54. The availability lead-time at a location 22 describes a waiting time due to back order at location 22 plus the transfer lead-time from a supplier to location 22 and the replenishment lead-time for the supplier of location 22. A method for estimating the availability lead-time of a part at location 22 is described in more detail with reference to FIG. 5.

A coverage function is determined at step 56. The coverage function describes the expected ability of a location 22 to completely or partially fill an order for a part, and may be determined from the demand, availability lead-time of the part, and inventory level for the part at location 22. The coverage function may be described using the expected backorder of the part at location 22. A method for determining a coverage function is described in more detail with reference to FIG. 6. Solver 39 optimizes the coverage function at step 58. Optimizing the coverage function may be accomplished by minimizing the expected backorder. At step 60, an optimized inventory for each part at each location 22 is determined from the optimized coverage function. At step 61, solver 39 reports the optimized inventory for each part at each location 22. As noted above, deployment may occur independently of redistribution. That is, inventory may be deployed, without ever being redistributed.

At step 62, redistribution module determines whether redistribution is required by calculating an excess and deficit for each part at each location 22 from the actual inventory and the optimal deployment. Redistribution of the inventory may be required if, for example, the actual inventory at each location 22 does not match the optimized inventory calculated for each location 22. As noted above, redistribution may redistribute parts according to the optimized inventory reported at step 61, or according to any suitable inventory plan. If redistribution is not required, deployment module 40 proceeds to step 63 to report any excess inventory and a recommendation to not perform a redistribution of parts. After reporting the result, the method is terminated. If redistribution is required, redistribution module proceeds to step 64 to check the transitions between locations 22. The transitions describe paths that may be used to transfer parts from one location 22 to another location 22.

At step 66, a transfer function describing the transfer of parts between locations 22 is optimized. Minimizing the total costs associated with transporting the parts may optimize the transfer function. A method for determining optimized transfer plans for transferring parts between locations 22 is described in more detail with reference to FIG. 7. At step 70, the optimized transfer plans, the resulting inventory levels, and possible excess in inventory of parts in the network are reported. After reporting the result, the method is terminated.

FIG. 4 illustrates an example method for calculating a demand for one or more parts at one or more locations 22. Deployment module 40 initiates the method at step 80 by selecting a part i. A location j is selected at step 82. Location j may be selected such that the demand at a demand endpoint is calculated first, and the demand at a supply endpoint is calculated last.

At step 84, an independent and a dependent demand for part i at location j is determined. The independent demand for part i at location j may be represented by λ′_(ij). The dependent demand for part i at location j may be represented λ_(ik), where k is a demand end point for location j. At step 86, the repair capability r_(ij) for part i at location j is determined. The repair capability r_(ij) may be determined from the proportion of demand for part i at location j that is repairable at location j. Demand is calculated at step 88. Starting with demand end points j, demand λ_(ij) for part i is equal to its independent demand. For any location j that is not a demand end point, the demand λ_(ij) for part i may be calculated using Equation (1):

$\begin{matrix} {\lambda_{ij} = {\lambda_{ij}^{\prime} + {\sum\limits_{k\mspace{14mu}{is}\mspace{14mu} a\mspace{14mu}{demand}\mspace{14mu}{point}\mspace{14mu}{for}\mspace{14mu} j}{\left( {1 - r_{ik}} \right)\lambda_{ik}}}}} & (1) \end{matrix}$

At step 92, deployment module 40 determines whether there is a next part for which a demand is to be determined. If there is a next part, deployment module 40 returns to step 80 to select the next part. If there is no next part, deployment module 40 proceeds to step 94 to output the calculated demand for each part at each location. After outputting the demand, the method is terminated.

FIG. 5 illustrates an example method for estimating the availability lead-time of one or more parts at one or more locations 22. Deployment module 40 initiates the method at step 102 by selecting a part i. A demand location j is selected at step 104, and a supply location l_(k) is selected at step 106. The supply location l_(k) may be selected from a prioritized list of n of supply locations l₁, . . . , l_(n). For each supply location I_(k), the list may describe a proportion C_(ilkj) of a demand for part i at demand location j that is scheduled to be satisfied by supply location l_(k), a probability α_(ilkj) that part i is filled at supply location l_(k) for demand location j, and a lead-time T_(ilkj) for a part i to flow from supply location l_(k) to demand location j. Demand location j and supply location l_(k) may be selected such that the availability lead-time at a supply endpoint is calculated first, and the availability lead-time at a demand endpoint is calculated last.

At step 108, a probability P_(ilkj) of a supply location l_(k) filling an order for part i placed by a demand location j, given that the order is not filled by another supply location, is calculated. The probability P_(il1j) for supply location I₁ may be computed using Equation (2): P_(il1j)=α_(il1j) C_(il1j)  (2)

At step 110, deployment module 40 determines whether there is a next supply location l_(k). If there is a next supply location, deployment module 40 returns to step 106 to select the next supply location. The probability P_(ilkj) of the next supply location l_(k) filling an order for part i placed by demand location j, given that the order is not filled by another supply location, may be computed at step 108 using the process described by recursive Equations (3): P_(il) _(k) _(j)=α_(il) _(k) _(j)C_(i) _(k) _(j) where C′_(il) _(i) _(j)=C_(il) _(i) _(j) C′ _(il) _(k) _(j) =C _(il) _(k) _(j)+(1−α_(il) _(k−1) _(j))C _(il) _(k−1) _(j) for k>1  (3)

If there is no next supply location at step 110, deployment module 40 proceeds to step 112 to output the probabilities of the supply locations I_(k) fulfilling an order placed by demand location j.

At step 113, an availability lead-time T_(ij) for each location j is calculated. Availability lead-time T_(ij) may be calculated according to recursive Equation (4):

$\begin{matrix} {T_{ij} = {\sum\limits_{k = 1}^{n}{\left( {T_{d_{k}j} + {\frac{{EBO}_{{il}_{k}}\left( S_{{il}_{k}} \right)}{\lambda_{{il}_{k}}}T_{{il}_{k}}}} \right)P_{{il}_{k}j}}}} & (4) \end{matrix}$

The expected number of completely backordered demand B_(c) may be described by Equation (5):

$\begin{matrix} {{EBO}_{c} = {\chi{\sum\limits_{x = S_{ij}}^{\infty}{{xP}\left( X \middle| \mu_{ij} \right)}}}} & (5) \end{matrix}$

where P(X|μ_(ij))=e^(−μ) ^(v) μ_(ij) ^(x)/x! is the Poisson probability mass function for the distribution of demand with mean μ_(ij), μ_(ik) represents the mean number of parts i in the pipeline at supply location k. The expected number of partially backordered demand B_(p) for part i at location j may be described by Equation (6):

$\begin{matrix} {{EBO}_{p} = {\left( {1 - \chi} \right){\sum\limits_{x = S_{q}}^{\infty}{\left( {x - S_{ij}} \right){P\left( X \middle| \mu_{ij} \right)}}}}} & (6) \end{matrix}$

The expected number of backorders EBO (S_(ij)) having the stock level S_(ij) of part i at location j may be defined using Equation (7):

$\begin{matrix} \begin{matrix} {{{EBO}\left( S_{ij} \right)} = {{\chi{\sum\limits_{x = S_{ij}}^{\infty}{{xP}\left( X \middle| \mu_{ij} \right)}}} + {\left( {1 - \chi} \right){\sum\limits_{x = S_{ij}}^{\infty}{\left( {x - S_{ij}} \right){P\left( X \middle| \mu_{ij} \right)}}}}}} \\ {= {\sum\limits_{x = S_{ij}}^{\infty}{\left( {x - {\chi\mspace{11mu} S_{ij}}} \right){{P\left( X \middle| \mu_{ij} \right)}.}}}} \end{matrix} & (7) \end{matrix}$

At step 114, the replenishment lead-time ∂_(ij) for part i at demand location j is calculated. The replenishment lead-time ∂_(ij) for part i at location j may be calculated using Equation (8): ∂_(ij) =r _(ij)τ_(ij)+(1−r _(ij))T _(ij)  (8)

where T_(ij) represents the repair lead-time for part i at demand location j. The lead-time demand μ_(ij) of a part i at demand location j is estimated at step 116. The lead-time demand is related to a number of parts in a pipeline. The lead-time demand may be estimated using Equation (9): μ_(ij)=λ_(ij)∂_(ij)  (9)

At step 118, deployment module 40 determines whether there is a next demand location. If there is a next demand location, deployment module 40 returns to step 104 to select the next demand location. If there is no next demand location, deployment module 40 proceeds to step 120 to determine whether there is a next part. If there is a next part, deployment module 40 returns to step 102 to select the next part. If there is no next part, deployment module 40 proceeds to step 122 to report the lead-time demand of each part at each location 22. After reporting the lead-time demand, the method is terminated.

FIG. 6 illustrates an example method for generating a coverage function for one or more parts at one or more locations 22. Deployment module 40 initiates the method at step 132 by selecting a location j. A part i is selected at step 134.

At step 136, a completely filled demand D_(c) for part i at location j is calculated at step 136. A completely filled demand D_(c) may be described by Equation (10):

$\begin{matrix} {D_{c} = {\sum\limits_{x = 0}^{\vartheta_{ij} - 1}{{xP}\left( X \middle| \mu_{ij} \right)}}} & (10) \end{matrix}$

where P(X|μ_(ij))=e^(−μ) ^(ij) μ_(ij) ^(x)/x! is the Poisson probability mass function for the distribution of demand with mean μ_(ij). A partially filled demand D_(p) for part i at location j is calculated at step 138. The partially filled D_(p) demand may be described by Equation (11):

$\begin{matrix} {D_{p} = {{\chi\left( {S_{ij} - 1} \right)}\left\lbrack {1 - {\sum\limits_{x = 0}^{\vartheta - 1}{P\left( X \middle| \mu_{ij} \right)}}} \right\rbrack}} & (11) \end{matrix}$

where x is the percentage of partial fill allowed for a part. At step 140, a coverage function for part i at location j is determined. The coverage function for part i at location j describes the expected proportion filled demand for part i of location j, and may be expressed using Equation (12):

$\begin{matrix} {{\left\{ {{\sum\limits_{x = 0}^{S_{ij}}{{xP}\left( X \middle| \mu_{ij} \right)}} + {\chi{\sum\limits_{x = S}^{\infty}{\left( {S_{ij} - 1} \right){P\left( X \middle| \mu_{ij} \right)}}}}} \right\}/\mu_{ij}} = {\left\{ {{\sum\limits_{x = 0}^{S_{ij}}{\left( {x - {\chi\left( {S_{ij} - 1} \right)}} \right){P\left( X \middle| \mu_{ij} \right)}}} + {\chi\left( {S_{ij} - 1} \right)}} \right\}/\mu_{ij}}} & (12) \end{matrix}$

At step 142, deployment module 40 determines whether there is a next part. If there is a next part, deployment module 40 returns to step 134 to select the next part. If there is no next part, deployment module 40 proceeds to step 144 to determine whether there is a next location. If there is a next location, deployment module 40 returns to step 132 to select the next location. If there is no next location, deployment module 40 proceeds to step 146 to determine the coverage function for the number of parts at the number of locations. The coverage function may be expressed as the weighted average of coverage for the parts at locations. The coverage function for the parts at the locations may be expressed by Expression (13):

$\begin{matrix} {\sum\limits_{j = 1}^{J}{\left\{ {{\sum\limits_{i = 1}^{I}{\beta_{i}{\sum\limits_{x = 0}^{S_{ij}}{\left\lbrack {x - {\chi\; S_{ij}}} \right\rbrack{P\left( X \middle| \mu_{ij} \right)}}}}} + {\chi\; S_{ij}}} \right\}/{\sum\limits_{i = 1}^{I}\mu_{ij}}}} & (13) \end{matrix}$

where β_(i) represents a weight of part i, which may be based on an importance measure of part i. At step 148, constraints for the coverage function may be defined. Constraints may include, for example, the following:

a. The weighted average of coverage for the parts at each location j is greater than or equal to the coverage target ω_(i) at location j, which may be expressed by Expression (13a):

$\begin{matrix} {{{\left\lbrack {\sum\limits_{i = 1}^{I}\left\{ {{\sum\limits_{x = 0}^{S_{ij}}{\left\lbrack {x - {\chi\; S_{ij}}} \right\rbrack{P\left( X \middle| \mu_{ij} \right)}}} + {\chi\; S_{ij}}} \right\}} \right\rbrack/{\sum\limits_{i = 1}^{I}\mu_{ij}}} \geq \omega_{j}},{\forall j}} & \left( {13a} \right) \end{matrix}$

b. The coverage for each part i at each location j is greater than or equal to the coverage target for part i at location j, which may be expressed by Expression (13b):

$\begin{matrix} {{{{\sum\limits_{x = 0}^{S_{ij}}{\left\lbrack {x - {\chi\; S_{ij}}} \right\rbrack{P\left( {X❘\mu_{ij}} \right)}}} + {\chi\; S_{ij}}} \geq {\alpha_{j}\mu_{ij}}},{\forall i},{\forall j}} & \left( {13b} \right) \end{matrix}$

c. The number of new purchases for a part i, X_(ij) at location j, which may be expressed by Expression (13c): X _(ij) =[S _(ij)+γ_(i)λ_(ij) −Y _(ij)]⁺ , ∀i, ∀j  (13c)

where γ_(i) represents a proportion of a demand for a failed part i, and (x)⁺=max (0,x).

d. The inventory investment at each location j is less than or equal to the inventory investment limit Inv_(j) for location j, which may be expressed by Expression (13d):

$\begin{matrix} {{{\sum\limits_{i = 1}^{I}{C_{i}\left( {S_{ij} + {\gamma_{i}\lambda_{ij}} - Y_{ij}} \right)}} \leq {Inv}_{j}},{\forall j}} & \left( {13d} \right) \end{matrix}$

where C_(i) represents a purchase price for part i, and Y_(ij) represents an on-hand inventory for part i at location j.

e. The overall inventory investment is less than or equal to an overall inventory investment limit Inv, which may be expressed by Expression (13e):

$\begin{matrix} {{\sum\limits_{i = 1}^{I}{C_{i}X_{ij}}} \leq {Inv}} & \left( {13e} \right) \end{matrix}$

f. The overall inventory cost is less than or equal to overall budget B, which may be expressed by Expression (13f):

$\begin{matrix} {{{\sum\limits_{j = 1}^{J}\left\{ {\sum\limits_{i = 1}^{I}\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + {E\; B\; O_{ij}}} \right)} + {k_{i}\lambda_{ij}}} \right\rbrack} \right\}} + {\sum\limits_{j}{\sum\limits_{i = 1}^{I}{C_{i}x_{ij}}}}} \leq B} & \left( {13f} \right) \end{matrix}$

where h_(ij) represents a holding cost per unit of part i at location j, and k_(i) represents an order cost for part i.

g. The cost at each location j is less than or equal to a budget B_(j) at location j, which may be expressed by Expression (13g):

$\begin{matrix} {{{\sum\limits_{i = 1}^{I}\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + {E\; B\; O_{ij}}} \right)} + {k_{i}\lambda_{ij}} + {C_{i}\left( {S_{ij} + {\gamma_{i}\lambda_{ij}} - Y_{ij}} \right)}^{+}} \right\rbrack} \leq B_{j}},{\forall j}} & \left( {13g} \right) \end{matrix}$

h. The total volume occupied by parts at each location j is less than or equal to the volume capacity limit V_(j) at location j, which may be expressed by Expression (13h):

$\begin{matrix} {{{\sum\limits_{i = 1}^{I}{v_{i}S_{ij}}} \leq V_{j}},{\forall j}} & \left( {13h} \right) \end{matrix}$

i. The stock levels S_(ij) are integers, which may be expressed by Expression (13i): S_(ij) are integers  (13i)

At step 150, the coverage function is converted to a backorder function that corresponds to expected backorders, and the constraints are expressed in terms of backorders. Using the backorder function may provide for a simpler optimization process. The backorder function may be Expression (14):

$\begin{matrix} {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{E\; B\;{O_{ij}\left( S_{ij} \right)}}}} & (14) \end{matrix}$

Minimizing the backorder function is equivalent to maximizing the coverage function. The constraints may be expressed by Expressions (14a):

$\begin{matrix} {{{{{{S_{ij} \geq S_{ij}^{M}},{\forall i},{\forall j}}{{{\sum\limits_{i = 1}^{I}{E\; B\;{O_{ij}\left( S_{ij} \right)}}} \leq {\left( {1 - \varpi_{j}} \right){\sum\limits_{i = 1}^{I}\mu_{ij}}}},{\forall j}}X_{ij}} \geq {S_{ij} + \left\lceil {{\gamma_{i}\lambda_{ij}} - Y_{ij}} \right\rceil}},{\forall i}}{{{\sum\limits_{j = 1}^{J}\left\{ {\sum\limits_{i = 1}^{I}\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + {E\; B\; O_{ij}}} \right)} + {k_{i}\lambda_{ij}}} \right\rbrack} \right\}} + {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{C_{i}x_{ij}}}}} \leq B}{{{\sum\limits_{i = 1}^{I}\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + {E\; B\; O_{ij}}} \right)} + {k_{i}\lambda_{ij}} + {C_{i}\left( {S_{ij} + {\gamma_{i}\lambda_{ij}} - Y_{ij}} \right)}} \right\rbrack} \leq B_{j}},{\forall j}}{{{\sum\limits_{i = 1}^{J_{1}}{v_{i}S_{ij}}} \leq V_{j}},{\forall j}}{S_{ij}\mspace{20mu}\text{are}\mspace{14mu}\text{integers}}} & \left( {14a} \right) \end{matrix}$

where S_(ij) ^(M) represents the minimum stock level that guarantees the minimum target coverage. The high degree of non-linearity of the constraints may be reduced by replacing the minimum target coverage constraint for each part at each location expressed by Expression (14a) with an equivalent constraint expressed as S_(ij)≧S_(ij) ^(M), ∀i, ∀j. The definition of the number of new purchases expressed by Expression (14b) may be replaced with a relaxed constraint expressed as X_(ij)≧S_(ij)+┌γ_(i)λ_(ij)−Y_(ij)┐, ∀i.

Maximization of the coverage function may be shown to be equivalent to minimizing the backorder function. The weighted average of coverage for distribution network 20 may be expressed by Expression (14b):

$\begin{matrix} {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{\beta_{ij}{\theta_{ij}\left( S_{ij} \right)}}}} & \left( {14b} \right) \end{matrix}$

where θ_(ij)(S_(ij)) represents the coverage for part i at location j defined by Equation (14c):

$\begin{matrix} {{\theta_{ij}\left( S_{ij} \right)} = {\left\{ {{\sum\limits_{x = 0}^{S_{ij}}{{xP}\left( {X❘\mu_{ij}} \right)}} + {\chi{\sum\limits_{x = {S_{ij} + 1}}^{\infty}{S_{ij}{P\left( {X❘\mu_{ij}} \right)}}}}} \right\}/\mu_{ij}}} & \left( {14c} \right) \end{matrix}$

The backorder function describes the total expected number of backorders for distribution network 20 and may be expressed by Expression (14d):

$\begin{matrix} {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{{EBO}_{ij}\left( S_{ij} \right)}}} & \left( {14d} \right) \end{matrix}$

The following proposition may be established:

Proposition 1: Vector S_(j)=(S_(1j), . . . , S_(lj)) satisfies the performance constraint expressed by Expression (14e):

$\begin{matrix} {{\sum\limits_{i = 1}^{I}{\mu_{ij}{\theta_{ij}\left( S_{ij} \right)}}} \geq {\omega_{j}{\sum\limits_{i = 1}^{j}\mu_{ij}}}} & \left( {14e} \right) \end{matrix}$

if and only if vector S_(j) satisfies an expected backorders constraint expressed by Expression (14f):

$\begin{matrix} {{\sum\limits_{i = 1}^{I}{{EBO}_{ij}\left( S_{ij} \right)}} \leq {\left( {1 - \omega_{j}} \right){\sum\limits_{i = 1}^{I}\mu_{ij}}}} & \left( {14f} \right) \end{matrix}$

A relationship between expected backorder EBO_(ij)(S_(ij)) and performance θ_(ij) (S_(ij)) may be established according to Equations (14g):

$\begin{matrix} {{{\theta_{ij}\left( S_{ij} \right)} = {\left\{ {\mu_{ij} - {\sum\limits_{x = {S_{ij} + 1}}^{\infty}{{xP}\left( X \middle| \mu_{ij} \right)}} + {\chi{\sum\limits_{x = {S_{ij} + 1}}^{\infty}{S_{ij}{P\left( X \middle| \mu_{ij} \right)}}}}} \right\}/\mu_{ij}}}{{\theta_{ij}\left( S_{ij} \right)} = {\left\{ {\mu_{ij} - {\sum\limits_{x = S_{ij}}^{\infty}{\left( {x - {\chi\; S_{ij}}} \right){P\left( X \middle| \mu_{ij} \right)}}}} \right\}/\mu_{ij}}}{{\theta_{ij}\left( S_{ij} \right)} = {{\left\{ {\mu_{ij} - {{EBO}_{ij}\left( S_{ij} \right)}} \right\}/\mu_{ij}} = {1 - {\left\{ {{EBO}_{ij}\left( S_{ij} \right)} \right\}/\mu_{ij}}}}}{{{EBO}_{ij}\left( S_{ij} \right)} = {\mu_{ij}\left\lbrack {1 - {\theta_{ij}\left( S_{ij} \right)}} \right\rbrack}}} & \left( {14g} \right) \end{matrix}$

For any set of S_(ij) that satisfies the performance constraint expressed by Expression (14f), the following Expressions (14h) may be shown:

$\begin{matrix} {{{\sum\limits_{i = 1}^{I}{{EBO}_{ij}\left( S_{ij} \right)}} \leq {\left( {1 - \omega_{j}} \right){\sum\limits_{i = 1}^{1}\mu_{ij}}}}{{\sum\limits_{i = 1}^{I}{\mu_{ij}\left\lbrack {1 - {\theta_{ij}\left( S_{ij} \right)}} \right\rbrack}} \leq {\left\lbrack {1 - \omega_{j}} \right\rbrack{\sum\limits_{i = 1}^{I}\mu_{ij}}}}{{{\sum\limits_{i = 1}^{I}\mu_{ij}} - {\sum\limits_{i = 1}^{I}{\mu_{ij}{\theta_{ij}\left( S_{ij} \right)}}}} \leq {{\sum\limits_{i = 1}^{I}\mu_{ij}} - {\omega_{j}{\sum\limits_{i = 1}^{I}\mu_{ij}}} - {\sum\limits_{i = 1}^{I}{\mu_{ij}{\theta_{ij}\left( S_{ij} \right)}}}} \leq {{- \omega_{j}}{\sum\limits_{i = 1}^{I}\mu_{ij}}}}{{\sum\limits_{i = 1}^{I}{\mu_{ij}{\theta_{ij}\left( S_{ij} \right)}}} \geq {\omega_{j}{\sum\limits_{i = 1}^{I}\mu_{ij}}}}} & \left( {14h} \right) \end{matrix}$

The stock level S_(ij) in question satisfies the location performance constraint expressed by Equations (14g). The steps may be reversed to prove the converse.

The following proposition describing the relationship between performance and coverage may be established:

Proposition: Maximizing system-wide coverage is equivalent to minimizing the total system-wide backorders.

The proposition may be established according to Equations (14i):

$\begin{matrix} {{Maximize}\begin{matrix} {{\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{\mu_{ij}{\theta_{ij}\left( S_{ij} \right)}}}} = {{\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}1}} - {{EBO}_{ij}\left( S_{ij} \right)}}} \\ {= {1 - {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{{EBO}_{ij}\left( S_{ij} \right)}}}}} \\ {= {{- \left\lbrack {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{{EBO}_{ij}\left( S_{ij} \right)}}} \right\rbrack} - 1}} \end{matrix}{{{Maximize} - \left\lbrack {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{{EBO}_{ij}\left( S_{ij} \right)}}} \right\rbrack - 1} \equiv {{Maximize}\underset{j = 1}{\overset{J}{\mspace{11mu}\sum}}{\sum\limits_{i = 1}^{I}{{EBO}_{ij}\left( S_{ij} \right)}}}}} & \left( {14i} \right) \end{matrix}$

At step 154, the objective function that measures expected backorder as expressed by Expression (13) may be linearized. To linearize the objective function and constraints, the non-linear terms of the objective function and constraints may be approximated by linear terms. The non-linear terms are discrete and convex, so a first-order linear approximation using the finite difference for two neighboring discontinuous points may be used to approximate each non-linear term. Each non-linear term in the objective function and the constraints is replaced with a continuous variable t_(ij) and a linearization constraint that describes the under estimation at points of discontinuity is added to the constraints.

The linearized objective function may be expressed by Expression (15):

$\begin{matrix} {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}t_{ij}}} & (15) \end{matrix}$

The linearization constraint may be expressed by Expression (16): t _(ij) ≧m _(ij)(X−X _(ij))+b _(ij) , ∀S _(ij) <X _(ij) ≦S _(upper) , ∀i,j  (16)

where m_(ij)=P(X>X_(ij)|μ_(ij)), b_(ij)=P(X>X_(ij)|μ_(ij))(X−X_(ij))+EBO_(ij)(X_(y)+1), and S_(upper) is the upper bound on the inventory for part i at location j. Other constraints may be expressed by Expressions (16a):

$\begin{matrix} {{{S_{ij} \geq S_{ij}^{M}},{{\forall i} = 1},{\ldots\mspace{11mu} I_{1}},{\forall{{{j\left\lbrack {{\sum\limits_{i = 1}^{I}{\sum\limits_{x = 0}^{S_{ij}}{\left\lbrack {x - {\chi\; S_{ij}}} \right\rbrack{P\left( X \middle| \mu_{ij} \right)}}}} + {\chi\; S_{ij}}} \right\rbrack}/{\sum\limits_{i = 1}^{I}\mu_{ij}}} \geq \omega_{j}}},{\forall j}}{{X_{ij} \geq {{\sum\limits_{j = 1}^{J}S_{ij}} + {\gamma_{i}\lambda_{ij}} - Y_{ij}}},{{\forall i} = 1},\ldots\mspace{11mu},I}{{\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + t_{ij}} \right)} + {k_{i}\lambda_{ij}} + {C_{i}x_{ij}}} \right\rbrack}} \leq B}{{{\sum\limits_{i = 1}^{I}\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + t_{ij}} \right)} + {k_{i}\lambda_{ij}}} \right\rbrack} \leq B_{j}},{\forall j}}{{\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}{C_{i}\left( {S_{ij} + {\gamma_{i}\lambda_{ij}} - Y_{ij}} \right)}}} \leq {Inv}}{{{\sum\limits_{i = 1}^{I_{1}}{C_{i}\left( {S_{ij} + {\gamma_{i}\lambda_{ij}} - Y_{ij}} \right)}} \leq {Inv}_{j}},{\forall j}}{{{\sum\limits_{i = 1}^{I_{1}}{v_{i}S_{ij}}} \leq V_{j}},{\forall j}}{{S_{ij}\mspace{14mu}{are}\mspace{14mu}{integers}},{{\forall i} = 1},\ldots\;,I_{2},{\forall j}}} & \left( {16a} \right) \end{matrix}$

After linearizing, deployment module 40 solves the resulting mixed integer-programming problem and determines the optimal stock levels for each part at each location.

An objective function measuring the system-wide total cost may also be defined at step 154. The total cost function may be expressed by Expression (16b):

$\begin{matrix} {\sum\limits_{j = 1}^{J}{\sum\limits_{i = 1}^{I}\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + {EBO}_{ij}} \right)} + {k_{i}\lambda_{ij}} + {C_{i}x_{ij}}} \right\rbrack}} & \left( {16b} \right) \end{matrix}$

The constraints for the total cost function may be expressed by Expressions (16c):

$\begin{matrix} {{{S_{ij} \geq S_{ij}^{M}},{{\forall i} = 1},{\Lambda\; I},{\forall{{{j\left\lbrack {\sum\limits_{i = 1}^{I}\left\{ {{\sum\limits_{x = 0}^{S_{c}}{\left\lbrack {x - {\chi\; S_{ij}}} \right\rbrack{P\left( X \middle| \mu_{ij} \right)}}} + {\chi\; S_{ij}}} \right\}} \right\rbrack}/{\sum\limits_{i = 1}^{I}\mu_{ij}}} \geq \omega_{j}}},{\forall j}}{{X_{ij} \geq {S_{ij} + \left\lceil {{\gamma_{i}\lambda_{ij}} - Y_{ij}} \right\rceil}},{{\forall i} = 1},\ldots\mspace{11mu},I}{{{\sum\limits_{i = 1}^{I}{v_{i}S_{ij}}} \leq V_{j}},{\forall j}}{{S_{ij}\mspace{14mu}{are}\mspace{14mu}{integers}},{{\forall i} = 1},\ldots\;,I,{\forall j}}} & \left( {16c} \right) \end{matrix}$

The total cost function and the constraints may also be linearized at step 154 in order to allow the objective function to be optimized by solver 39. The total cost objective function, as expressed by Expression (16b), may be linearized according to Expression (16d):

$\begin{matrix} {\sum\limits_{j = 1}^{J}\;{\sum\limits_{i = 1}^{I}\;\left\lbrack {{h_{ij}\left( {S_{ij} - \mu_{ij} + t_{ij}} \right)} + {k_{i}\lambda_{ij}} + {C_{i}x_{ij}}} \right\rbrack}} & \left( {16d} \right) \end{matrix}$

The constraints may be linearized according to Expressions (16e):

$\begin{matrix} {{{t_{ij} \geq {{m_{ij}\left( {S - X_{ij}} \right)} + b_{ij}}},{\forall{S_{ij}^{M} < X_{j} \leq S_{upper}}},{\forall i},j}{{S_{ij} \geq S_{ij}^{M}},{{\forall i} = 1},{\Lambda\mspace{11mu} I_{1}},{\forall j}}{{{\sum\limits_{i = 1}^{I}\; t_{ij}} \geq {\left( {1 - \omega_{j}} \right){\sum\limits_{i = 1}^{I}\;\mu_{ij}}}},{\forall j}}{{X_{ij} \geq {S_{ij} + \left\lceil {{\gamma_{i}\lambda_{ij}} - Y_{ij}} \right\rceil}},{{\forall i} = 1},{\ldots\mspace{11mu} I}}{{{\sum\limits_{i = 1}^{I_{1}}\;{v_{i}S_{ij}}} \leq V_{j}},{\forall j}}{{S_{ij}\mspace{14mu}{are}\mspace{14mu}{integers}},{{\forall i} = 1},\ldots\mspace{11mu},I_{2},{\forall j}}} & \left( {16e} \right) \end{matrix}$

After linearizing, deployment module 40 solves the resulting mixed integer-programming problem and determines the optimal stock levels for each part at each location.

Although an example of the invention and its advantages are described in detail, a person skilled in the art could make various alterations, additions, and omissions without departing from the spirit and scope of the present invention as defined by the appended claims. 

1. A system for deploying parts, the system comprising one or more computer systems each comprising one or more processing units and one or more memory units, the system comprising: means for defining a plurality of locations comprising a plurality of supply locations and a plurality of demand locations, a supply location configured to supply a plurality of parts to a demand location; means for computing a demand for each part at each location; means for estimating an availability lead-time for each part at each location; means for computing a lead-time demand for each part at each location using the availability lead-times for the part; means for generating a completely filled demand from the lead-time demands and the stock levels to be determined as a result of an optimization; means for generating a partially filled demand from the lead-time demands and the stock levels; and means for generating a coverage function for the parts at the locations from the completely filled demand and the partially filled demand.
 2. A computer-readable storage medium embodied with software for deploying parts, the software when executed using one or more computers is configured to: define a plurality of locations comprising a plurality of supply locations and a plurality of demand locations, a supply location configured to supply a plurality of parts to a demand location; compute a demand for each part at each location; estimate an availability lead-time for each part at each location; compute a lead-time demand for each part at each location using the availability lead-times for the part; generate a completely filled demand from the lead-time demands and the stock levels; generate a partially filled demand from the lead-time demands and the stock levels; and generate a coverage function for the parts at the locations from the completely filled demand and the partially filled demand.
 3. The computer-readable storage medium of claim 2, further configured to: optimize the coverage function; determine an optimal deployment of the parts at the locations according to the optimized coverage function; and compute a stock level for each part at each location.
 4. The computer-readable storage medium of claim 2, further configured to: determine a completely backordered demand from the lead-time demands and the stock values; determine a partially backordered demand from the lead-time demands and the stock values; generate a backorder function for the parts at the locations from the completely back ordered demand and the partially backordered demand; minimize the backorder function; and determine an optimal deployment of the parts at the locations according to the minimized backorder function.
 5. The computer-readable storage medium of claim 2, further configured to: generate a cost function for the parts at the locations; minimize the cost function; and determine an optimal deployment of the parts at the locations according to the minimized cost function.
 6. The computer-readable storage medium of claim 2, further configured to compute the lead-time demand for a part at a location comprising a demand location by: calculating a probability that a supply location can supply the part to the demand location; computing a replenishment lead-time at the demand location according to the probability; and computing the lead-time demand at the demand location from the demand at the demand location and the replenishment lead-time at the demand location.
 7. The computer-readable storage medium of claim 2, further configured to compute the lead-time demand for a part at a location by: receiving an ordered list comprising at least a subset of the supply locations; repeating the following for each supply location of the ordered list: calculating a probability that a supply location supplies the part to the demand location, given that no other supply location has supplied the part; and selecting the next supply location of the ordered list; and estimating the availability lead-time at the location from the calculated probabilities.
 8. The computer-readable storage medium of claim 2, further configured to estimate the availability lead-time for a part at a location comprising a target demand location by: estimating an availability lead-time for the part at a supply endpoint; and repeating the following until the target demand location is reached: estimating an availability lead-time for the part at a supply location; and estimating an replenishment lead-time for the part at a demand location according to the availability lead-time for the part at the supply location, the supply location configured to supply the part to the demand location.
 9. The computer-readable storage medium of claim 2, further configured to compute the demand for a part at a location comprising a supply location by: calculating a demand at a demand location configured to receive the part from the supply location; calculating a dependent demand at the supply location according to the demand at the demand location; calculating an independent demand at the supply location; and computing the demand at the supply location from the dependent demand and the independent demand.
 10. The computer-readable storage medium of claim 2, further configured to compute the demand for a part at a location comprising a supply location by: calculating a demand at a demand location configured to receive the part from the supply location; establishing a probability of repairing the part at the demand location; and determining the demand at a location according to the demand at the demand location for the location and the probability of repairing the part at the demand location.
 11. The computer-readable storage medium of claim 2, further configured to compute the demand for a part at a location comprising a target supply location by: calculating a demand at a demand endpoint; and repeating the following until the target supply location is reached: calculating a demand at a demand location; and calculating a demand at a supply location configured to supply the part to the demand location according to the demand at the demand location. 